Using Link Cuts to Attack Internet Routing

Attacks on the routing system, with the goal of diverting traffic past an enemy-controlled point for purposes of eavesdropping or connection-hijacking, have long been known. In principle, at least, these attacks can be countered by use of appropriate authentication techniques. We demonstrate a new attack, based on link-cutting, that cannot be countered in this fashion. Armed with a topology map and a list of already-compromised links and routers, an attacker can calculate which links to disable, in order to force selected traffic to pass the compromised elements. The calculations necessary to launch this attack are quite efficient; in our implementation, most runs took less than half a second, on databases of several hundred nodes. We also suggest a number of work-arounds, including one based on using intrusion detection systems to modify routing metrics

Rectangular Layouts and Contact Graphs

Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design, computational geometry, and GIS. Minimizing the area of their corresponding {\em rectangular layouts} is a key problem. We study the area-optimization problem and show that it is NP-hard to find a minimum-area rectangular layout of a given contact graph. We present O(n)-time algorithms that construct $O(n^2)$-area rectangular layouts for general contact graphs and $O(n\log n)$-area rectangular layouts for trees. (For trees, this is an $O(\log n)$-approximation algorithm.) We also present an infinite family of graphs (rsp., trees) that require $\Omega(n^2)$ (rsp., $\Omega(n\log n)$) area. We derive these results by presenting a new characterization of graphs that admit rectangular layouts using the related concept of {\em rectangular duals}. A corollary to our results relates the class of graphs that admit rectangular layouts to {\em rectangle of influence drawings}.Comment: 28 pages, 13 figures, 55 references, 1 appendi

Algorithms and Bounds for Drawing Directed Graphs

In this paper we present a new approach to visualize directed graphs and their hierarchies that completely departs from the classical four-phase framework of Sugiyama and computes readable hierarchical visualizations that contain the complete reachability information of a graph. Additionally, our approach has the advantage that only the necessary edges are drawn in the drawing, thus reducing the visual complexity of the resulting drawing. Furthermore, most problems involved in our framework require only polynomial time. Our framework offers a suite of solutions depending upon the requirements, and it consists of only two steps: (a) the cycle removal step (if the graph contains cycles) and (b) the channel decomposition and hierarchical drawing step. Our framework does not introduce any dummy vertices and it keeps the vertices of a channel vertically aligned. The time complexity of the main drawing algorithms of our framework is $O(kn)$, where $k$ is the number of channels, typically much smaller than $n$ (the number of vertices).Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018

Energy-efficient casting processes

Metal casting is one of the most energy-intensive manufacturing processes that have developed along the evolution of mankind. Although nowadays its scientific and technological aspects are well established, in the context of future resource scarcity and environmental pollution pressures, new studies appear necessary to describe the “foundry of the future” where energy and material efficiency are of great importance to guarantee competitiveness alongside environmental protection. In this chapter, both managerial and technical good practices aimed at implementing energy-efficient casting processes are presented alongside a few examples. The “Small is Beautiful” philosophy is presented as a systematic approach towards energy resilient manufacturing and, potentially, sustainability in the long term. Thus, this chapter aims at providing an overview of the different aspects comprising the state of the art in the industry and examples of research themes in academia about energy-efficient casting processes

1 Summary

EXene is a multi-threaded X window system toolkit that we have been developing on top of Con-current ML [Rep91a, Rep90] (CML). This paper describes a snapshot of eXene’s development, as pre-sented in two talks at the ML workshop at CMU. 2 CML overview Both the implementation and the user’s view of eXene rely heavily on the concurrency model pro-vided by CML ¡. CML is based on the sequential language SML [MTH90, MT91] and inherits the fol-lowing good features of SML: functions as first-class values, strong static typing, polymorphism, datatypes and pattern matching, lexical scoping, exception handling and a state-of-the-art module facility. The sequential performance of CML benefits from the quality of the SML/NJ compiler. In addition CML has the following properties: CML provides a high-level model of concurrency with dynamic creation of threads and typed channels, and rendezvous-style communication. This distributed-memory model fits well with the mostly applicative style of SML. CML is a higher-order concurrent language. Just as SML supports functions as first-class values, CML supports synchronous operations as first-class values. These values, called events, provide the tools for building new synchronization abstractions, which are tailored to the application

Improved Circular Layouts

Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node placement often gives rise to long edges and an overall dense drawing. We suggest here three independent, complementary techniques for lowering the density and improving the readability of circular layouts. First, a new algorithm is given for placing the nodes on the circle such that edge lengths are reduced. Second, we enhance the circular drawing style by allowing some of the edges to be routed around the exterior of the circle. This is accomplished with an algorithm for optimally selecting such a set of externally routed edges. The third technique reduces density by coupling groups of edges as bundled splines that share part of their route. Together, these techniques are able to reduce clutter, density and crossings compared with existing methods